Decidable Expansions of Labelled Linear Orderings
نویسندگان
چکیده
منابع مشابه
Decidable Expansions of Labelled Linear Orderings
Let M = (A,<, P ) where (A,<) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type ω or −ω, and the monadic second-order theory of M is decidable, then there exists a non-trivial expansion M ′ of M by a monadic predicate such that the monadic second-order theory of M ′ is still decidable.
متن کاملWord Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable
A tree automatic structure is a structure whose domain can be encoded by a regular tree language such that each relation is recognisable by a finite automaton processing tuples of trees synchronously. Words can be regarded as specific simple trees and a structure is word automatic if it is encodable using only these trees. The question naturally arises whether a given tree automatic structure i...
متن کاملAsymptotic expansions for enumerating connected labelled graphs
I compute several terms of the asymptotic expansion of the number of connected labelled graphs with n nodes and m edges, for small k = m−n. I thus identify an error in a recent paper of Flajolet et al.
متن کاملLow linear orderings
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We construct a computable presentation of any low weakly η-like linear ordering with no strongly η-like interval. Also we prove that there exists a noncomputably presentable low2 weakly η-like linear ordering with no strongly η-like interval.
متن کاملCountably Complementable Linear Orderings
We say that a countable linear ordering L is countably complementable if there exists a linear ordering L, possibly uncountable, such that for any countable linear ordering B, L does not embed into B if and only if B embeds into L. We characterize the linear orderings which are countably complementable. We also show that this property is equivalent to the countable version of the finitely faith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2011
ISSN: 1860-5974
DOI: 10.2168/lmcs-7(2:5)2011